Dynamic Buffer Allocation – A New Approach to Reduce Buffer Size at Receiver in VCAT Enabled Next Generation SDH Networks

نویسندگان

  • Sunanda Manke
  • Kavita Khare
  • S. D. Sapre
چکیده

Next-generation SONET/SDH technologies namely, Generic Framing Procedure (GFP), Virtual Concatenation (VCAT) and Link Capacity Adjustment Scheme (LCAS) enable network operators to provide integrated data and voice services over their legacy SONET/SDH infrastructure to generate new revenue. Data packets are encapsulated using framing protocols GFP. VCAT is a process of distributing the GFP framed data payload in number of virtual channels of same capacity forming a Virtually Concatenated Group (VCG). LCAS is used for dynamic bandwidth allocation. Individual member of VCG can traverse through any path to reach the destination and all VCs are combined at the destination as per the MFI (Multiframe Indicator) and Sequence Number written in the control packet of the SDH frame. As all the VCG members are routed independently, they do not reach the destination at the same time. These streams thus incur differential delay. Buffers are provided at the receiver to compensate differential delay and combine the streams for generating the data signal. More the differential delay more is the buffer requirement at the receiver. Differential delay/buffer size can be reduced by proper routing of the traffic. In the existing receiver circuits, all incoming streams are allotted fixed and equal buffer size, specifying maximum differential delay it can compensate. This results in large amount of buffer requirement and wastage of buffer as all the streams do not suffer same differential delay. To overcome this limitation, this paper proposes a novel scheme of allotting buffers dynamically to all the streams. To achieve this, differential delay between the streams is computed by extracting the MFI and then as per the delay, each stream is allotted buffer from a common buffer pool. The common buffer pool size is network architecture dependent. This scheme reduces the buffer requirement by approx 50% at the receiver. For functional verification of the concept hardware circuit is designed. The circuit accepts three VC-3 streams, calculates the differential delay, allots buffers as per the delay and finally outputs synchronized streams compensating the differential delay.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic bandwidth adaptation in NG SDH/WDM transport networks using LCAS

Traffic patterns of data services are known to be highly dynamic and have been characterized as self-similar caused by long-range dependent transfer times and file size distributions [8]. This burstiness appears on various time scales and makes link and network dimensioning more difficult compared to classical voice traffic. In this paper, we adopt dynamic bandwidth adaptation to transport netw...

متن کامل

Fuzzy based buffer management in wireless multimedia networks

This paper presents a fuzzy based buffer management scheme that performs buffer allocation and packet dropping for wireless multimedia networks in the context of future generation cellular networks. In this scheme, buffers are allocated to requesting application by using buffer allocation factor and packets are dropped for an application by using dropping factor. A buffer allocation factor for ...

متن کامل

A genetic algorithm approach for a dynamic cell formation problem considering machine breakdown and buffer storage

Cell formation problem mainly address how machines should be grouped and parts be processed in cells. In dynamic environments, product mix and demand change in each period of the planning horizon. Incorporating such assumption in the model increases flexibility of the system to meet customer’s requirements. In this model, to ensure the reliability of the system in presence of unreliable machine...

متن کامل

Adaptive policy of buffer allocation and preventive maintenance actions in unreliable production lines

The buffer allocation problem is an NP-hard combinatorial optimization problem, and it is an important design problem in manufacturing systems. The research proposed in this paper concerns a product line consisting of n unreliable machines with n − 1 buffers and a preventive maintenance policy. The focus of the research is to obtain a better trade-off between the buffer level ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010